Stability Analysis of Gradient-Based Neural Networks for Optimization Problems

| The paper introduces a new approach to analyze the stability of neu-ral network models without using any Lyapunov function. With the new method, we investigate the stability properties of the general gradient-based neural network model for optimization problems. Our discussion includes both isolated equilibrium points and connected equilibrium sets which could be unbounded. For a general optimization problem, if the objective function is bounded below and its gradient is Lipschitz continuous , we prove that a) any trajectory of the gradient-based neural network converges to an equilibrium point, and b) the Lyapunov stability is equivalent to the asymptotical stability in the gradient-based neural networks. For a convex optimization problem, under the same assumptions, we show that any trajectory of gradient-based neural networks will converge to an asymptotically stable equilibrium point of the neural networks. For a general nonlinear objective function, we propose a reened gradient-based neural network, whose trajectory with any arbitrary initial point will converge to an equilibrium point, which satisses the second order necessary optimality conditions for optimization problems. Promising simulation results of the reened gradient-based neural network on some problems are also reported.